def main():
t = int(input())
for _ in range(t):
_ = int(input())
boxes = [int(i) for i in input().split()]
mn = min(boxes)
total = 0
for x in boxes:
total += abs(x-mn)
print(total)
main()#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for(int x=0; x<t; x++) {
int n;
cin >> n;
long long int a[n] = {}, sum = 0;
for(int i=0; i<n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a+n);
cout << ( sum - (a[0]*n) ) << endl;
}
return 0;
}
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |